package org.blogwu.learn.algorithm.树.二叉搜索树;

public class _二叉搜索树层序遍历 {

    public static void main(String[] args) {
        BinarySearchTree<Integer> tree = TreeTest.getTreeAndPrint();
        System.out.println("");
//        BinarySearchTree.levelOrderTraversal(tree.getRoot());
        Visitor<Integer> visitor = new Visitor<Integer>() {
            @Override
            public void visit(Integer integer) {
                System.out.print(integer + ",");
            }
        };
//        System.out.println( tree.heightByIteration(  tree.getRoot() ) );
    }


}
